Improved Randomized Algorithm for k-Submodular Function Maximization
نویسندگان
چکیده
منابع مشابه
Improved Approximation Algorithms for k-Submodular Function Maximization
This paper presents a polynomial-time 1/2-approximation algorithm for maximizing nonnegative k-submodular functions. This improves upon the previous max{1/3, 1/(1+a)}-approximation by Ward and Živný [15], where a = max{1, √ (k − 1)/4}. We also show that for monotone ksubmodular functions there is a polynomial-time k/(2k− 1)-approximation algorithm while for any ε > 0 a ((k + 1)/2k + ε)-approxim...
متن کاملDerandomization for k-submodular maximization
Submodularity is one of the most important property of combinatorial optimization, and k-submodularity is a generalization of submodularity. Maximization of a k-submodular function is NP-hard, and approximation algorithm has been studied. For monotone k-submodular functions, [Iwata, Tanigawa, and Yoshida 2016] gave k/(2k−1)-approximation algorithm. In this paper, we give a deterministic algorit...
متن کاملImproved Inapproximability for Submodular Maximization
We show that it is Unique Games-hard to approximate the maximum of a submodular function to within a factor 0.695, and that it is Unique Games-hard to approximate the maximum of a symmetric submodular function to within a factor 0.739. These results slightly improve previous results by Feige, Mirrokni and Vondrák (FOCS 2007) who showed that these problems are NP-hard to approximate to within 3/...
متن کاملSubmodular Function Maximization
Submodularity is a property of set functions with deep theoretical consequences and far– reaching applications. At first glance it appears very similar to concavity, in other ways it resembles convexity. It appears in a wide variety of applications: in Computer Science it has recently been identified and utilized in domains such as viral marketing (Kempe et al., 2003), information gathering (Kr...
متن کاملMonotone k-Submodular Function Maximization with Size Constraints
A k-submodular function is a generalization of a submodular function, where the input consists of k disjoint subsets, instead of a single subset, of the domain. Many machine learning problems, including influence maximization with k kinds of topics and sensor placement with k kinds of sensors, can be naturally modeled as the problem of maximizing monotone k-submodular functions. In this paper, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2021
ISSN: 0895-4801,1095-7146
DOI: 10.1137/19m1277692